Latent Feature Independent Cascade Model for Social Propagation

نویسندگان

  • Yuya Yoshikawa
  • Tomoharu Iwata
  • Hiroshi Sawada
چکیده

People share various types of information including opinions on hot topics, bookmarking activity and rumors via online communities. To make it possible to predict future trends in online communities, it is important that we develop a model of information diffusion through social networks and a method for estimating its parameters. In this paper, we present a latent feature independent cascade model, which can effectively estimate diffusion probabilities by capturing the influences between latent communities. In particular, we incorporate two types of latent features for each node. The first represents the features as a sender and the second represents the features as a receiver. We demonstrate experimentally that the proposed model can estimate the diffusion probabilities more accurately than commonly used methods. We also show the effectiveness of the proposed model for estimating information spread.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic Probabilistic Models for Latent Feature Propagation in Social Networks

Current Bayesian models for dynamic social network data have focused on modelling the influence of evolving unobserved structure on observed social interactions. However, an understanding of how observed social relationships from the past affect future unobserved structure in the network has been neglected. In this paper, we introduce a new probabilistic model for capturing this phenomenon, whi...

متن کامل

Complete Submodularity Characterization in the Comparative Independent Cascade Model

We study the propagation of comparative ideas in social network. A full characterization for submodularity in the comparative independent cascade (Com-IC) model of two-idea cascade is given, for competing ideas and complementary ideas respectively. We further introduce One-Shot model where agents show less patience toward ideas, and show that in One-Shot model, only the stronger idea spreads wi...

متن کامل

Fuzzy Forcing Set on Fuzzy Graphs

The investigation of impact of fuzzy sets on zero forcing set is the main aim of this paper. According to this, results lead us to a new concept which we introduce it as Fuzzy Zero Forcing Set (FZFS). We propose this concept and suggest a polynomial time algorithm to construct FZFS. Further more we compute the propagation time of FZFS on fuzzy graphs. This concept can be more efficient to model...

متن کامل

Learning User-Specific Latent Influence and Susceptibility from Information Cascades

Predicting cascade dynamics has important implications for understanding information propagation and launching viral marketing. Previous works mainly adopt a pair-wise manner, modeling the propagation probability between pairs of users using n independent parameters for n users. Consequently, these models suffer from severe overfitting problem, especially for pairs of users without direct inter...

متن کامل

Maximizing the Speed of Influence in Social Networks

Influence maximization is the study of seed-node selection in a social network in order to achieve the maximized number of influenced nodes. Previous studies focused on three areas, i.e., designing propagation models, improving seed-node selection algorithms and exploiting the structure of social networks. However, most of these studies ignored the time constraint in influence propagation. Here...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013